COMPUTATIONS ON SLEPTSOV NETS
نویسندگان
چکیده
منابع مشابه
Proof Nets, Garbage, and Computations
We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. Abstract: We study the problem of local and asynchron...
متن کاملProof nets , Garbage , and Computations 1
Stefano Guerrini a Simone Martini c Andrea Masini b aDipartimento di Scienze dell’Informazione Università di Roma ‘La Sapienza’ Via Salaria, 113 I-00198, Roma, Italy email: [email protected] bDipartimento di Matematica, Università di Trento Via Sommarive 14 I-38050, Trento, Italy email: [email protected] cDipartimento di Matematica e Informatica, Università di Udine Via delle Scien...
متن کاملSpi Computations on Grids Computations on Grids Computations on Grids
We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular automata, relaxing in some way the inherent synchronism of such networks. and asynchronous computations. R esum e Nous etudions comment le graphe sous-jacent de d ependances d'un automate cellulaire de di...
متن کاملSome computations in the cyclic permutations of completely rational nets
In this paper we calculate certain chiral quantities from the cyclic permutation orbifold of a general completely rational net. We determine the fusion of a fundamental soliton, and by suitably modified arguments of A. Coste , T. Gannon and especially P. Bantay to our setting we are able to prove a number of arithmetic properties including congruence subgroup properties for S, T matrices of a c...
متن کاملModelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars
Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed systems, which properly extends Petri nets. The idea is that the state of a distributed system can be naturally represented (at a suitable level of abstraction) as a graph and local state transform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: System Informatics
سال: 2017
ISSN: 2307-6410
DOI: 10.31144/si.2307-6410.2017.n9.p42-62